package leetCode.offer11;

public class Solution1 implements Solution{

    @Override
    public int minArray(int[] numbers) {
        for(int i=numbers.length-1;i>0;i--){
            if(numbers[i-1]>numbers[i]){
                return numbers[i];
            }
        }
        return numbers[0];
    }
}
